<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>plutao.sid.inpe.br 800</site>
		<holdercode>{isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S}</holdercode>
		<identifier>J8LNKAN8RW/3AFLJ55</identifier>
		<repository>dpi.inpe.br/plutao/2011/09.22.20.02</repository>
		<lastupdate>2015:03.20.17.11.45 dpi.inpe.br/plutao@80/2008/08.19.15.01 administrator</lastupdate>
		<metadatarepository>dpi.inpe.br/plutao/2011/09.22.20.02.36</metadatarepository>
		<metadatalastupdate>2018:06.05.00.01.31 dpi.inpe.br/plutao@80/2008/08.19.15.01 administrator {D 2011}</metadatalastupdate>
		<label>lattes: 6187221670775160 1 Yanasse:2011:UmCaEs</label>
		<citationkey>Yanasse:2011:CaEs</citationkey>
		<title>Sobre o problema de minimização e trocas de ferramentas: um caso especial</title>
		<year>2011</year>
		<secondarytype>PRE CN</secondarytype>
		<numberoffiles>1</numberoffiles>
		<size>587 KiB</size>
		<author>Yanasse, Horacio Hideki,</author>
		<group>LAC-CTE-INPE-MCT-BR</group>
		<affiliation>Instituto Nacional de Pesquisas Espaciais (INPE)</affiliation>
		<electronicmailaddress>horacio@lac.inpe.br</electronicmailaddress>
		<e-mailaddress>horacio@lac.inpe.br</e-mailaddress>
		<conferencename>Simpósio Brasileiro de Pesquisa Operacional, 43.</conferencename>
		<conferencelocation>Ubatuba</conferencelocation>
		<date>2011</date>
		<volume>1</volume>
		<pages>107-107</pages>
		<booktitle>Anais</booktitle>
		<tertiarytype>Artigo</tertiarytype>
		<transferableflag>1</transferableflag>
		<contenttype>External Contribution</contenttype>
		<versiontype>publisher</versiontype>
		<keywords>Otimização Combinatória, Combinatorial optimization.</keywords>
		<abstract>Mostra-se que quando um grafo MOSP correspondente a um problema de minimização de trocas de ferramentas possui algum vértice de corte então quando se remove este vértice de corte e todas as arestas incidentes nele, uma solução ótima para o problema original pode ser construído a partir de soluções ótimas dos problemas de minimização de trocas de ferramentas correspondentes às componentes conexas do grafo resultante.  ABSTRACT: We show that when the MOSP graph corresponding to a minimization of tool switches problem has some cutting vertex then, when we remove this vertex and all edges incident to it, an optimal solution for the original problem can be built from optimal solutions of minimization of tool switches problems corresponding to the connected components of the resulting graph.</abstract>
		<area>COMP</area>
		<language>pt</language>
		<targetfile>yanasse_sobre.pdf</targetfile>
		<usergroup>lattes</usergroup>
		<usergroup>secretaria.cpa@dir.inpe.br</usergroup>
		<usergroup>marciana</usergroup>
		<readergroup>administrator</readergroup>
		<readergroup>marciana</readergroup>
		<visibility>shown</visibility>
		<readpermission>allow from all</readpermission>
		<documentstage>not transferred</documentstage>
		<nexthigherunit>8JMKD3MGPCW/3ESGTTP</nexthigherunit>
		<hostcollection>dpi.inpe.br/plutao@80/2008/08.19.15.01</hostcollection>
		<username>marciana</username>
		<lasthostcollection>dpi.inpe.br/plutao@80/2008/08.19.15.01</lasthostcollection>
		<url>http://plutao.sid.inpe.br/rep-/dpi.inpe.br/plutao/2011/09.22.20.02</url>
	</metadata>
</metadatalist>